Call by Contract for Cryptographic Protocols
نویسندگان
چکیده
Call by contract is a way to specify and use interchangeable services in secure protocols, so that protocols and services can be independently designed and verified. A selection algorithm is given to test whether a candidate service is uniformly selectable. To facilitate independent security verification of the calling protocol and its services, contracts and requests also provide an NDA (Non-Disclosure Agreement). Informally, NDAs are confidentiality constraints on parameters.
منابع مشابه
Deciding Properties of Contract-Signing Protocols
We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. As a consequence, we obtain that crucial properties of contract-signing protocols such as balance are de-
متن کاملDeciding Epistemic and Strategic Properties of Cryptographic Protocols
We propose a new, widely applicable model for analyzing knowledge-based (epistemic) and strategic properties of cryptographic protocols. We prove that the corresponding model checking problem with respect to an expressive epistemic strategic logic is decidable. As corollaries, we obtain decidability of complex security properties including coercion-resistance of voting protocols, accountability...
متن کاملDesign of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method
Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...
متن کاملA Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols
Some cryptographic tasks, such as contract signing and other related tasks, need to ensure complex, branching time security properties. When defining such properties one needs to deal with subtle problems regarding the scheduling of non-deterministic decisions, the delivery of messages sent on resilient (non-adversarially controlled) channels, fair executions (executions where no party, both ho...
متن کاملTransducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for instance, by single rewrite rules—we call these protocols non-looping— and (2) protocols, such as group protocols, where the protocol steps are complex and typically involve an iterative or recursive computation—we call the...
متن کامل